An Efficient Algorithm in Fault Tolerance for Electing Coordinator in Distributed Systems

The distributed computing systems, predominantly computing and computer based systems generally tolerate changes which are not desired, in their internal structure or external environment in regular working which can be referred to as faults. A Fault may be an operational fault or design fault. The techniques to tolerate the fault are used to make a system fault tolerable. Checkpointing is a technique for fault tolerance which periodically records the state of the system in stable storage. The current work suggests a new coordinated checkpointing algorithm that effectively selects a new coordinator process whenever the existing coordinator stops working due to any failure. In this algorithm, the election of new coordinator takes less time and minimum network message transmission in comparison to existing algorithms. This Case Study results show that the new algorithm takes lesser time than the existing algorithms in electing new coordinator as well as tolerating the faults. The Smart Interval reduces the message overhead because message communication is not allowed outside the Smart Interval.